Coupling Feasibility Pump and Large Neighborhood Search to solve the Steiner team orienteering problem
نویسندگان
چکیده
The Steiner Team Orienteering Problem (STOP) is defined on a digraph in which arcs are associated with traverse times, and whose vertices labeled as either mandatory or profitable, being the latter provided rewards (profits). Given homogeneous fleet of vehicles M, goal to find up m = |M| disjoint routes (from an origin vertex destination one) that maximize total sum collected while satisfying given limit route's duration. Naturally, all must be visited. In this work, we show solely finding feasible solution for STOP NP-hard propose Large Neighborhood Search (LNS) heuristic problem. algorithm initial solutions obtained by means matheuristic framework known Feasibility Pump (FP). our implementation, FP uses backbone commodity-based formulation reinforced three classes valid inequalities. To knowledge, two them also introduced work. LNS itself combines classical local searches from literature routing problems long-term memory component based Path Relinking. We use primal bounds state-of-the-art cutting-plane evaluate quality heuristic. Computational experiments efficiency effectiveness proposed solving benchmark 387 instances. Overall, imply average percentage gap only 0.54% when compared baseline. particular, reaches best previously 382 Additionally, 21 these cases, even able improve over bounds.
منابع مشابه
An augmented large neighborhood search method for solving the team orienteering problem
In the Team Orienteering Problem (TOP), a team of vehicles attempts to collect rewards at a given number of stops within a specified time frame. Once a vehicle visits a stop and collects its reward, no other vehicles may collect the reward. Typically, a team cannot visit all stops and therefore has to identify the “best” set of stops to visit in order to maximizes total rewards. We propose a la...
متن کاملSolving multi-objective team orienteering problem with time windows using adjustment iterated local search
One of the problems tourism faces is how to make itineraries more effective and efficient. This research has solved the routing problem with the objective of maximizing the score and minimizing the time needed for the tourist’s itinerary. Maximizing the score means collecting a maximum of various kinds of score from each destination that is visited. The profits differ according to whether those...
متن کاملThe Team Orienteering Arc Routing Problem
The Team Orienteering Arc Routing Problem (TOARP) is the extension to the arc routing setting of the Team Orienteering Problem (TOP). In the TOARP a set of potential customers, each associated with an arc of a directed graph, is available and a profit is collected when a potential customer is served that is when the associated arc is traversed. A fleet of vehicles is available to visit the cust...
متن کاملThe split delivery capacitated team orienteering problem
In this paper we study the capacitated team orienteering problem where split deliveries are allowed. A set of potential customers is given, each associated with a demand and a profit. The set of customers to be served by a fleet of capacitated vehicles has to be identified in such a way that the profit collected is maximized, while satisfying constraints on the maximum time duration of each rou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2021
ISSN: ['0305-0548', '1873-765X']
DOI: https://doi.org/10.1016/j.cor.2020.105175